Accelerated Double Direction Method for Solving Unconstrained Optimization Problems
نویسندگان
چکیده
منابع مشابه
A Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems
In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...
متن کاملAn Accelerated First-Order Method for Solving Unconstrained SOS Polynomial Optimization Problems
Our interest lies in solving large-scale unconstrained SOS (sum of squares) polynomial optimization problems. Because interior-point methods for solving these problems are severely limited by the large-scale, we are motivated to explore efficient implementations of an accelerated first-order method to solve this class of problems. By exploiting special structural properties of this problem clas...
متن کاملAn accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems
An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems Dimitris Bertsimas , Robert M. Freund & Xu Andy Sun To cite this article: Dimitris Bertsimas , Robert M. Freund & Xu Andy Sun (2013) An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems, Optimization Methods and Software, 28:3...
متن کاملAn Accelerated First-Order Method for Solving Unconstrained Polynomial Optimization Problems
Our interest lies in solving large-scale unconstrained polynomial optimization problems. Because interior-point methods for solving these problems are severely limited by the large-scale, we are motivated to explore efficient implementations of an accelerated first-order method to solve this class of problems. By exploiting special structural properties of this problem class, we greatly reduce ...
متن کاملA FAST GA-BASED METHOD FOR SOLVING TRUSS OPTIMIZATION PROBLEMS
Due to the complex structural issues and increasing number of design variables, a rather fast optimization algorithm to lead to a global swift convergence history without multiple attempts may be of major concern. Genetic Algorithm (GA) includes random numerical technique that is inspired by nature and is used to solve optimization problems. In this study, a novel GA method based on self-a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2014
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2014/965104